An Efficient Memetic Algorithm for the Minimum Load Coloring Problem
نویسندگان
چکیده
منابع مشابه
A memetic algorithm for the Minimum Sum Coloring Problem
Given an undirected graph G, the Minimum Sum Coloring Problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of G such that the total sum of the colors assigned to the vertices is minimized. This paper presents a memetic algorithm for MSCP based on a tabu search procedure with two neighborhoods and a multi-parent crossover operator. Experiments on...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولOn the Minimum Load Coloring Problem
Given a graph G = (V,E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring φ : V → {red, blue} is a pair dφ = (rφ, bφ), where rφ is the number of edges with at least one end-vertex colored red and bφ is the number of edges with at least one end-vertex colored blue. Our aim is to find a coloring φ such that the (maximum) load, lφ := 1 m · max{rφ, bφ}, is mi...
متن کاملMemetic Algorithm for Minimum Energy Broadcast Problem
A heuristic memetic algorithm for the minimum energy broadcasting problem in wireless ad hoc networks is discussed in this chapter. Broadcasting in wireless networks is different from broadcasting in wired networks because every node in wireless networks is equipped with omnidirectional antennas and several nodes are covered in a single transmission. Each node within the transmission range of t...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2019
ISSN: 2227-7390
DOI: 10.3390/math7050475